package LeetCode;

public class LC_268_MissingNumber {

    public static void main(String[] args) {

    }

    static class Solution {
        public int missingNumber(int[] nums) {
            int ret = nums.length;
            for (int i = 0; i < nums.length; i++) ret += (i - nums[i]);
            return ret;
        }
    }

}